Bounded Proofs and Step Frames
Identifieur interne : 001630 ( Main/Exploration ); précédent : 001629; suivant : 001631Bounded Proofs and Step Frames
Auteurs : Nick Bezhanishvili [Pays-Bas] ; Silvio Ghilardi [Italie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The longstanding research line investigating free algebra constructions in modal logic from an algebraic and coalgebraic point of view recently lead to the notion of a one-step frame [14], [8]. A one-step frame is a two-sorted structure which admits interpretations of modal formulae without nested modal operators. In this paper, we exploit the potential of one-step frames for investigating proof-theoretic aspects. This includes developing a method which detects when a specific rule-based calculus Ax axiomatizing a given logic L has the so-called bounded proof property. This property is a kind of an analytic subformula property limiting the proof search space. We define conservative one-step frames and prove that every finite conservative one-step frame for Ax is a p-morphic image of a finite Kripke frame for L iff Ax has the bounded proof property and L has the finite model property. This result, combined with a ‘one-step version’ of the classical correspondence theory, turns out to be quite powerful in applications. For simple logics such as K, T, K4, S4, etc, establishing basic metatheoretical properties becomes a completely automatic task (the related proof obligations can be instantaneously discharged by current first-order provers). For more complicated logics, some ingenuity is needed, however we successfully applied our uniform method to Avron’s cut-free system for GL and to Goré’s cut-free system for S4.3.
Url:
DOI: 10.1007/978-3-642-40537-2_6
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003B84
- to stream Istex, to step Curation: 003B40
- to stream Istex, to step Checkpoint: 000256
- to stream Main, to step Merge: 001642
- to stream Main, to step Curation: 001630
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Bounded Proofs and Step Frames</title><author><name sortKey="Bezhanishvili, Nick" sort="Bezhanishvili, Nick" uniqKey="Bezhanishvili N" first="Nick" last="Bezhanishvili">Nick Bezhanishvili</name></author><author><name sortKey="Ghilardi, Silvio" sort="Ghilardi, Silvio" uniqKey="Ghilardi S" first="Silvio" last="Ghilardi">Silvio Ghilardi</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F9CF5A986D5E1D12F7A1DEF5B290D83BC102535A</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40537-2_6</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-BZ098FZ5-X/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003B84</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003B84</idno><idno type="wicri:Area/Istex/Curation">003B40</idno><idno type="wicri:Area/Istex/Checkpoint">000256</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000256</idno><idno type="wicri:doubleKey">0302-9743:2013:Bezhanishvili N:bounded:proofs:and</idno><idno type="wicri:Area/Main/Merge">001642</idno><idno type="wicri:Area/Main/Curation">001630</idno><idno type="wicri:Area/Main/Exploration">001630</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Bounded Proofs and Step Frames</title><author><name sortKey="Bezhanishvili, Nick" sort="Bezhanishvili, Nick" uniqKey="Bezhanishvili N" first="Nick" last="Bezhanishvili">Nick Bezhanishvili</name><affiliation wicri:level="4"><country xml:lang="fr">Pays-Bas</country><wicri:regionArea>Utrecht University, Utrecht</wicri:regionArea><placeName><settlement type="city">Utrecht</settlement><region nuts="2" type="province">Utrecht (province)</region></placeName><orgName type="university">Université d'Utrecht</orgName></affiliation></author><author><name sortKey="Ghilardi, Silvio" sort="Ghilardi, Silvio" uniqKey="Ghilardi S" first="Silvio" last="Ghilardi">Silvio Ghilardi</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Università degli Studi di Milano, Milano</wicri:regionArea><wicri:noRegion>Milano</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The longstanding research line investigating free algebra constructions in modal logic from an algebraic and coalgebraic point of view recently lead to the notion of a one-step frame [14], [8]. A one-step frame is a two-sorted structure which admits interpretations of modal formulae without nested modal operators. In this paper, we exploit the potential of one-step frames for investigating proof-theoretic aspects. This includes developing a method which detects when a specific rule-based calculus Ax axiomatizing a given logic L has the so-called bounded proof property. This property is a kind of an analytic subformula property limiting the proof search space. We define conservative one-step frames and prove that every finite conservative one-step frame for Ax is a p-morphic image of a finite Kripke frame for L iff Ax has the bounded proof property and L has the finite model property. This result, combined with a ‘one-step version’ of the classical correspondence theory, turns out to be quite powerful in applications. For simple logics such as K, T, K4, S4, etc, establishing basic metatheoretical properties becomes a completely automatic task (the related proof obligations can be instantaneously discharged by current first-order provers). For more complicated logics, some ingenuity is needed, however we successfully applied our uniform method to Avron’s cut-free system for GL and to Goré’s cut-free system for S4.3.</div></front></TEI><affiliations><list><country><li>Italie</li><li>Pays-Bas</li></country><region><li>Utrecht (province)</li></region><settlement><li>Utrecht</li></settlement><orgName><li>Université d'Utrecht</li></orgName></list><tree><country name="Pays-Bas"><region name="Utrecht (province)"><name sortKey="Bezhanishvili, Nick" sort="Bezhanishvili, Nick" uniqKey="Bezhanishvili N" first="Nick" last="Bezhanishvili">Nick Bezhanishvili</name></region></country><country name="Italie"><noRegion><name sortKey="Ghilardi, Silvio" sort="Ghilardi, Silvio" uniqKey="Ghilardi S" first="Silvio" last="Ghilardi">Silvio Ghilardi</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001630 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001630 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F9CF5A986D5E1D12F7A1DEF5B290D83BC102535A
|texte= Bounded Proofs and Step Frames
}}
| This area was generated with Dilib version V0.6.33. |  |